School of IT Technical Report ELLIPSE AND ARC ROUTING ALGORITHMS FOR DELAUNAY TRIANGULATIONS
نویسندگان
چکیده
Oblivious online routing (OOR) algorithms are suitable when applications only have local information available to make routing decisions. This paper presents two new OOR algorithms for Delaunay triangulations: the Ellipse Routing algorithm and the Arc Routing algorithm. Both of their names come from the shapes of their searching areas for the next-hop neighbor. This paper also evaluates and compares the presented algorithms with three existing OOR algorithms in terms of link distances and Euclidean distances. The experimental results show that (1) the two new algorithms both perform better than the other three OOR algorithms in terms of Euclidean distance, but worse in terms of link distance and (2) Delaunay triangulations with random node placement have the property that the shortest paths in link distance metric and in Euclidean distance metric are discrepant in a large proportion. Finally, this paper poses two open problems based on the observations on the experimental results. Keywords— geometric graph; Delaunay triangulations; oblivious online routing; shortest paths.
منابع مشابه
The Open Capacitated Arc Routing Problem
The Open Capacitated Arc Routing Problem (OCARP) is a NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours that services a subset of edges with positive demand under capacity constraints. This problem is related to the Capacitated Arc Routing Problem (CARP) but differs from it since OCARP does not consider a depot, and...
متن کاملCorrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path
In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...
متن کاملPerformance Evaluation of Accurate Ellipse Fitting
This paper studies numerical schemes for fitting an ellipse to points in an image. First, the problem is posed as maximum likelihood, and the relationship to the KCR lower bound is stated. Then, the algorithms of FNS, HEIV, renormalization, and Gauss-Newton iterations are described. Using simulated and real image data, their convergence properties are compared, and their dependence on the shape...
متن کاملMicrosoft Word - john_icita_ell.rtf
-In this paper, we present a fast and robust ellipse extraction method. The proposed method can extract ellipses with high accuracy and speed from images with complicated backgrounds. It consists of two parts. First, we extract arc segments from an ellipse approximated by short straight lines that are extracted by a fast line extraction algorithm. Second, the arc segments are used to calculate ...
متن کاملEfficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
Fitting two-dimensional conic sections (e.g., circular and elliptical arcs) to a finite collection of points in the plane is an important problem in statistical estimation and has significant industrial applications. Recently there has been a great deal of interest in robust estimators, because of their lack of sensitivity to outlying data points. The basic measure of the robustness of an estim...
متن کامل